Analysis of FPTASes for the multi-objective shortest path problem
نویسندگان
چکیده
منابع مشابه
Evaluating FPTASes for the Multi-Objective Shortest Path Problem
We discuss three FPTASes for the Multi-Objective Shortest Path problem. Two of which are known in the literature, the third is a newly proposed FPTAS, aimed at exploiting small Pareto curves. The FPTASes are analyzed, empirically, based on worst case complexity, average case complexity and smoothed complexity. We also analyze the size of the Pareto curve under different conditions.
متن کاملA New Ranking Path Algorithm for the Multi-objective Shortest Path Problem
In this paper, we present a new algorithm for solving the multi-objective shortest path problem (MSPP) which consists of finding all the non-dominated paths between two nodes s and t (ND s-t paths), on a network where a multiple criteria function is defined over the set of arcs. The main feature of the algorithm is that, contrarily to the previous most efficient approaches for the MSPP, not all...
متن کاملFood Regulated Pareto Multi-Species: a new ACO Approach for the Multi-objective Shortest Path Problem
The use of metaheuristics in Multi-objective Combinatorial Optimization, particularly Ant Colony Optimization (ACO), has grown recently. This paper proposes an approach where multi-species ants compete for food resources. Each species has its own search strategy and do not access pheromone information of other species. As in nature, successful ant populations are allowed to grow, whereas the ot...
متن کاملLabelling Methods for the General Case of the Multi-objective Shortest Path Problem - a Computational Study
This paper is devoted to the study of labelling techniques for solving the multi-objective shortest path problem (MSPP) which is an extension of the shortest path problem (SPP) resulting from considering simultaneously more than one cost function (criteria) for the arcs. The generalization of the well known SPP labelling algorithm for the multiobjective situation is studied in detail and severa...
متن کاملExploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem
We present a natural vector-valued fitness function f for the multi-objective shortest path problem, which is a fundamental multi-objective combinatorial optimization problem known to be NP-hard. Thereafter, we conduct a rigorous runtime analysis of a simple evolutionary algorithm (EA) optimizing f. Interestingly, this simple general algorithm is a fully polynomial-time randomized approximation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2017
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.06.022